Optimal representation in average using Kolmogorov complexity
نویسندگان
چکیده
منابع مشابه
Optimal Representation in Average Using Kolmogorov Complexity
One knows from the Algorithmic Complexity Theory ’ [2-5,8, 141 that a word is incompressible on average. For words of pattern xm, it is natural to believe that providing x and m is an optimal average representation. On the contrary, for words like x @ y (i.e., the bit to bit x or between x and y), providing n and y is not an optimal description on average. In this work, we sketch a theory of av...
متن کاملAverage-Case Analysis Using Kolmogorov Complexity
This expository paper demonstrates how to use Kolmogorov complexity to do the average-case analysis via four examples, and exhibits a surprising property of the celebrated associated universal distribution. The four examples are: average case analysis of Heapsort 17, 15], average nni-distance between two binary rooted leave-labeled trees 20], compact routing in computer networks 3], average-cas...
متن کاملLower Bounds Using Kolmogorov Complexity
In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functions, which gives the complexity of finding a bit where inputs differ, for pairs of inputs that map to different function values. This measure and variants thereof were shown to imply lower bounds for quantum and randomized decis...
متن کاملRandomness Representation of Turbulence in Canopy Flows Using Kolmogorov Complexity Measures
Turbulence is often expressed in terms of either irregular or random fluid flows, without quantification. In this paper, a methodology to evaluate the randomness of the turbulence using measures based on the Kolmogorov complexity (KC) is proposed. This methodology is applied to experimental data from a turbulent flow developing in a laboratory channel with canopy of three different densities. T...
متن کاملKolmogorov complexity in perspective
We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented: namely, the mathematical notion of randomness (which goes back to the 60’s with the work of MartinLöf, Schnorr, Chaitin, Levin), and classification, which is a recent idea with provocative implementation by Vitanyi an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00275-2